0.07/0.13	% Problem    : Vampire---4.8_12119 : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n018.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1440
0.14/0.35	% WCLimit    : 180
0.14/0.35	% DateTime   : Mon Jul  3 13:14:31 EDT 2023
0.14/0.35	% CPUTime    : 
0.21/0.48	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119
0.21/0.48	# Version: 3.1pre001-ho
0.21/0.50	# Preprocessing class: HSSSSLSSSLMNHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting new_ho_10 with 900s (5) cores
0.21/0.50	# Starting new_ho_7 with 180s (1) cores
0.21/0.50	# Starting lpo8_lambda_fix with 180s (1) cores
0.21/0.50	# Starting lpo9_lambda_fix with 180s (1) cores
0.21/0.50	# lpo8_lambda_fix with pid 12455 completed with status 0
0.21/0.50	# Result found by lpo8_lambda_fix
0.21/0.50	# Preprocessing class: HSSSSLSSSLMNHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting new_ho_10 with 900s (5) cores
0.21/0.50	# Starting new_ho_7 with 180s (1) cores
0.21/0.50	# Starting lpo8_lambda_fix with 180s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
0.21/0.50	# Search class: HGHSS-FFMS32-MHSFMSBN
0.21/0.50	# partial match(3): HGHSS-FFMS31-SHSSMSBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.21/0.50	# Starting new_ho_10 with 98s (1) cores
0.21/0.50	# new_ho_10 with pid 12458 completed with status 0
0.21/0.50	# Result found by new_ho_10
0.21/0.50	# Preprocessing class: HSSSSLSSSLMNHSA.
0.21/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting new_ho_10 with 900s (5) cores
0.21/0.50	# Starting new_ho_7 with 180s (1) cores
0.21/0.50	# Starting lpo8_lambda_fix with 180s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
0.21/0.50	# Search class: HGHSS-FFMS32-MHSFMSBN
0.21/0.50	# partial match(3): HGHSS-FFMS31-SHSSMSBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.21/0.50	# Starting new_ho_10 with 98s (1) cores
0.21/0.50	# Preprocessing time       : 0.001 s
0.21/0.50	# Presaturation interreduction done
0.21/0.50	
0.21/0.50	# Proof found!
0.21/0.50	# SZS status Theorem
0.21/0.50	# SZS output start CNFRefutation
0.21/0.50	thf(decl_22, type, in: $i > $i > $o).
0.21/0.50	thf(decl_23, type, emptyset: $i).
0.21/0.50	thf(decl_24, type, setadjoin: $i > $i > $i).
0.21/0.50	thf(decl_25, type, setunion: $i > $i).
0.21/0.50	thf(decl_26, type, dsetconstr: $i > ($i > $o) > $i).
0.21/0.50	thf(decl_27, type, iskpair: $i > $o).
0.21/0.50	thf(decl_28, type, kpair: $i > $i > $i).
0.21/0.50	thf(decl_29, type, singleton: $i > $o).
0.21/0.50	thf(decl_30, type, ex1: $i > ($i > $o) > $o).
0.21/0.50	thf(decl_31, type, ex1I: $o).
0.21/0.50	thf(decl_32, type, kfst: $i > $i).
0.21/0.50	thf(decl_33, type, kfstpairEq: $o).
0.21/0.50	thf(decl_34, type, setukpairinjR: $o).
0.21/0.50	thf(decl_35, type, esk1_3: $i > ($i > $o) > $i > $i).
0.21/0.50	thf(decl_36, type, esk2_3: $i > ($i > $o) > $i > $i).
0.21/0.50	thf(decl_37, type, esk3_0: $i).
0.21/0.50	thf(decl_38, type, esk4_0: $i).
0.21/0.50	thf(decl_39, type, esk5_0: $i).
0.21/0.50	thf(decl_40, type, epred1_0: $i > $o).
0.21/0.50	thf(ex1, axiom, ((ex1)=(^[X1:$i, X4:$i > $o]:((singleton @ (dsetconstr @ X1 @ (^[X2:$i]:((X4 @ X2)))))))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', ex1)).
0.21/0.50	thf(singleton, axiom, ((singleton)=(^[X1:$i]:(?[X2:$i]:(((in @ X2 @ X1)&((X1)=(setadjoin @ X2 @ emptyset))))))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', singleton)).
0.21/0.50	thf(ex1I, axiom, ((ex1I)<=>![X1:$i, X4:$i > $o, X2:$i]:(((in @ X2 @ X1)=>((X4 @ X2)=>(![X3:$i]:(((in @ X3 @ X1)=>((X4 @ X3)=>((X3)=(X2)))))=>(ex1 @ X1 @ (^[X3:$i]:((X4 @ X3))))))))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', ex1I)).
0.21/0.50	thf(iskpair, axiom, ((iskpair)=(^[X1:$i]:(?[X2:$i]:(((in @ X2 @ (setunion @ X1))&?[X3:$i]:(((in @ X3 @ (setunion @ X1))&((X1)=(setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))))))))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', iskpair)).
0.21/0.50	thf(ksndsingleton, conjecture, (((kfstpairEq)=>(![X6:$i]:(((singleton @ (dsetconstr @ (setunion @ X6) @ (^[X2:$i]:(((X6)=(kpair @ (kfst @ X6) @ X2))))))<=(iskpair @ X6)))<=(setukpairinjR)))<=(ex1I)), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', ksndsingleton)).
0.21/0.50	thf(kfstpairEq, axiom, ((kfstpairEq)<=>![X2:$i, X3:$i]:(((kfst @ (kpair @ X2 @ X3))=(X2)))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', kfstpairEq)).
0.21/0.50	thf(setukpairinjR, axiom, ((setukpairinjR)<=>![X2:$i, X3:$i, X5:$i, X6:$i]:((((kpair @ X2 @ X3)=(kpair @ X5 @ X6))=>((X3)=(X6))))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', setukpairinjR)).
0.21/0.50	thf(kpair, axiom, ((kpair)=(^[X2:$i, X3:$i]:(setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))), file('/export/starexec/sandbox/tmp/tmp.uS9VQWw5Nh/Vampire---4.8_12119', kpair)).
0.21/0.50	thf(c_0_8, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X18:$i]:(((in @ X18 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X18 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[ex1])).
0.21/0.50	thf(c_0_9, plain, ((singleton)=(^[Z0/* 5 */:$i]:(?[X2:$i]:(((in @ X2 @ Z0)&((Z0)=(setadjoin @ X2 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])).
0.21/0.50	thf(c_0_10, plain, ((ex1I)<=>![X1:$i, X4:$i > $o, X2:$i]:(((in @ X2 @ X1)=>((X4 @ X2)=>(![X3:$i]:(((in @ X3 @ X1)=>((X4 @ X3)=>((X3)=(X2)))))=>(ex1 @ X1 @ (^[Z0/* 3 */:$i]:((X4 @ Z0))))))))), inference(fof_simplification,[status(thm)],[ex1I])).
0.21/0.50	thf(c_0_11, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X18:$i]:(((in @ X18 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X18 @ emptyset)))))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])).
0.21/0.50	thf(c_0_12, plain, ((ex1I)=(![X1:$i, X4:$i > $o, X2:$i]:(((in @ X2 @ X1)=>((X4 @ X2)=>(![X3:$i]:(((in @ X3 @ X1)=>((X4 @ X3)=>((X3)=(X2)))))=>(?[X19:$i]:(((in @ X19 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:(((X4 @ Z0))))))&((dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:(((X4 @ Z0)))))=(setadjoin @ X19 @ emptyset))))))))))), inference(apply_def,[status(thm)],[c_0_10, c_0_11])).
0.21/0.50	thf(c_0_13, plain, ((iskpair)=(^[Z0/* 5 */:$i]:(?[X2:$i]:(((in @ X2 @ (setunion @ Z0))&?[X3:$i]:(((in @ X3 @ (setunion @ Z0))&((Z0)=(setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[iskpair])).
0.21/0.50	thf(c_0_14, negated_conjecture, ~((![X29:$i, X30:$i > $o, X31:$i]:(((in @ X31 @ X29)=>((X30 @ X31)=>(![X32:$i]:(((in @ X32 @ X29)=>((X30 @ X32)=>((X32)=(X31)))))=>?[X33:$i]:(((in @ X33 @ (dsetconstr @ X29 @ (^[Z0/* 3 */:$i]:((X30 @ Z0)))))&((dsetconstr @ X29 @ (^[Z0/* 3 */:$i]:((X30 @ Z0))))=(setadjoin @ X33 @ emptyset))))))))=>(![X20:$i, X21:$i]:(((kfst @ (kpair @ X20 @ X21))=(X20)))=>(![X25:$i, X26:$i, X27:$i, X28:$i]:((((kpair @ X25 @ X26)=(kpair @ X27 @ X28))=>((X26)=(X28))))=>![X6:$i]:((?[X23:$i]:(((in @ X23 @ (setunion @ X6))&?[X24:$i]:(((in @ X24 @ (setunion @ X6))&((X6)=(setadjoin @ (setadjoin @ X23 @ emptyset) @ (setadjoin @ (setadjoin @ X23 @ (setadjoin @ X24 @ emptyset)) @ emptyset)))))))=>?[X22:$i]:(((in @ X22 @ (dsetconstr @ (setunion @ X6) @ (^[Z0/* 3 */:$i]:(((X6)=(kpair @ (kfst @ X6) @ Z0))))))&((dsetconstr @ (setunion @ X6) @ (^[Z0/* 3 */:$i]:(((X6)=(kpair @ (kfst @ X6) @ Z0)))))=(setadjoin @ X22 @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[ksndsingleton])]), c_0_12]), kfstpairEq]), c_0_9]), c_0_13]), setukpairinjR])])).
0.21/0.50	thf(c_0_15, plain, ![X34:$i, X35:$i]:(((kpair @ X34 @ X35)=(setadjoin @ (setadjoin @ X34 @ emptyset) @ (setadjoin @ (setadjoin @ X34 @ (setadjoin @ X35 @ emptyset)) @ emptyset)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[kpair])])).
0.21/0.50	thf(c_0_16, negated_conjecture, ![X36:$i, X37:$i > $o, X38:$i, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i, X50:$i]:((((((in @ (esk2_3 @ X36 @ X37 @ X38) @ (dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0)))))|(in @ (esk1_3 @ X36 @ X37 @ X38) @ X36)|~(X37 @ X38)|~(in @ X38 @ X36))&(((dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0))))=(setadjoin @ (esk2_3 @ X36 @ X37 @ X38) @ emptyset))|(in @ (esk1_3 @ X36 @ X37 @ X38) @ X36)|~(X37 @ X38)|~(in @ X38 @ X36)))&((((in @ (esk2_3 @ X36 @ X37 @ X38) @ (dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0)))))|(X37 @ (esk1_3 @ X36 @ X37 @ X38))|~(X37 @ X38)|~(in @ X38 @ X36))&(((dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0))))=(setadjoin @ (esk2_3 @ X36 @ X37 @ X38) @ emptyset))|(X37 @ (esk1_3 @ X36 @ X37 @ X38))|~(X37 @ X38)|~(in @ X38 @ X36)))&(((in @ (esk2_3 @ X36 @ X37 @ X38) @ (dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0)))))|((esk1_3 @ X36 @ X37 @ X38)!=(X38))|~(X37 @ X38)|~(in @ X38 @ X36))&(((dsetconstr @ X36 @ (^[Z0/* 3 */:$i]:((X37 @ Z0))))=(setadjoin @ (esk2_3 @ X36 @ X37 @ X38) @ emptyset))|((esk1_3 @ X36 @ X37 @ X38)!=(X38))|~(X37 @ X38)|~(in @ X38 @ X36)))))&(((kfst @ (kpair @ X41 @ X42))=(X41))&((((kpair @ X43 @ X44)!=(kpair @ X45 @ X46))|((X44)=(X46)))&(((in @ esk4_0 @ (setunion @ esk3_0))&((in @ esk5_0 @ (setunion @ esk3_0))&((esk3_0)=(setadjoin @ (setadjoin @ esk4_0 @ emptyset) @ (setadjoin @ (setadjoin @ esk4_0 @ (setadjoin @ esk5_0 @ emptyset)) @ emptyset)))))&(~(in @ X50 @ (dsetconstr @ (setunion @ esk3_0) @ (^[Z0/* 3 */:$i]:(((esk3_0)=(kpair @ (kfst @ esk3_0) @ Z0))))))|((dsetconstr @ (setunion @ esk3_0) @ (^[Z0/* 3 */:$i]:(((esk3_0)=(kpair @ (kfst @ esk3_0) @ Z0)))))!=(setadjoin @ X50 @ emptyset)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])).
0.21/0.50	thf(c_0_17, plain, ![X51:$i, X52:$i]:(((kpair @ X51 @ X52)=(setadjoin @ (setadjoin @ X51 @ emptyset) @ (setadjoin @ (setadjoin @ X51 @ (setadjoin @ X52 @ emptyset)) @ emptyset)))), inference(variable_rename,[status(thm)],[c_0_15])).
0.21/0.50	thf(c_0_18, negated_conjecture, ((esk3_0)=(setadjoin @ (setadjoin @ esk4_0 @ emptyset) @ (setadjoin @ (setadjoin @ esk4_0 @ (setadjoin @ esk5_0 @ emptyset)) @ emptyset))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_19, plain, ![X1:$i, X2:$i]:(((kpair @ X1 @ X2)=(setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.21/0.50	thf(c_0_20, plain, ![X55:$i]:(((~(epred1_0 @ X55)|((esk3_0)=(kpair @ (kfst @ esk3_0) @ X55)))&(((esk3_0)!=(kpair @ (kfst @ esk3_0) @ X55))|(epred1_0 @ X55)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])).
0.21/0.50	thf(c_0_21, negated_conjecture, ![X2:$i, X1:$i]:(((kfst @ (kpair @ X1 @ X2))=(X1))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_22, negated_conjecture, ((kpair @ esk4_0 @ esk5_0)=(esk3_0)), inference(rw,[status(thm)],[c_0_18, c_0_19])).
0.21/0.50	thf(c_0_23, plain, ![X53:$i]:(((epred1_0 @ X53)<=>((esk3_0)=(kpair @ (kfst @ esk3_0) @ X53)))), introduced(definition)).
0.21/0.50	thf(c_0_24, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X5:$i]:((((X2)=(X5))|((kpair @ X1 @ X2)!=(kpair @ X3 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_25, plain, ![X1:$i]:((((esk3_0)=(kpair @ (kfst @ esk3_0) @ X1))|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.21/0.50	thf(c_0_26, negated_conjecture, ((kfst @ esk3_0)=(esk4_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.21/0.50	thf(c_0_27, negated_conjecture, ![X1:$i]:((~((((in @ X1 @ (dsetconstr @ (setunion @ esk3_0) @ epred1_0)))=(($true))))|((dsetconstr @ (setunion @ esk3_0) @ epred1_0)!=(setadjoin @ X1 @ emptyset)))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_16]), c_0_23]), c_0_23])).
0.21/0.50	thf(c_0_28, negated_conjecture, ![X2:$i, X1:$i]:((((X1)=(esk5_0))|((kpair @ X2 @ X1)!=(esk3_0)))), inference(spm,[status(thm)],[c_0_24, c_0_22])).
0.21/0.50	thf(c_0_29, plain, ![X1:$i]:((((kpair @ esk4_0 @ X1)=(esk3_0))|~((epred1_0 @ X1)))), inference(rw,[status(thm)],[c_0_25, c_0_26])).
0.21/0.50	thf(c_0_30, negated_conjecture, ![X1:$i]:((((dsetconstr @ (setunion @ esk3_0) @ epred1_0)!=(setadjoin @ X1 @ emptyset))|~((in @ X1 @ (dsetconstr @ (setunion @ esk3_0) @ epred1_0))))), inference(cn,[status(thm)],[c_0_27])).
0.21/0.50	thf(c_0_31, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:(((in @ (esk2_3 @ X1 @ X4 @ X2) @ (dsetconstr @ X1 @ X4))|(X4 @ (esk1_3 @ X1 @ X4 @ X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_32, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:((((dsetconstr @ X1 @ X4)=(setadjoin @ (esk2_3 @ X1 @ X4 @ X2) @ emptyset))|(X4 @ (esk1_3 @ X1 @ X4 @ X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_33, plain, ![X1:$i]:(((epred1_0 @ X1)|((esk3_0)!=(kpair @ (kfst @ esk3_0) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.21/0.50	thf(c_0_34, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:(((in @ (esk2_3 @ X1 @ X4 @ X2) @ (dsetconstr @ X1 @ X4))|((esk1_3 @ X1 @ X4 @ X2)!=(X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_35, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:((((dsetconstr @ X1 @ X4)=(setadjoin @ (esk2_3 @ X1 @ X4 @ X2) @ emptyset))|((esk1_3 @ X1 @ X4 @ X2)!=(X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_36, plain, ![X1:$i]:((((X1)=(esk5_0))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.21/0.50	thf(c_0_37, negated_conjecture, ![X1:$i]:(((epred1_0 @ (esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ X1))|~((in @ X1 @ (setunion @ esk3_0)))|~((epred1_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])).
0.21/0.50	thf(c_0_38, plain, ![X1:$i]:(((epred1_0 @ X1)|((kpair @ esk4_0 @ X1)!=(esk3_0)))), inference(rw,[status(thm)],[c_0_33, c_0_26])).
0.21/0.50	thf(c_0_39, negated_conjecture, ![X1:$i]:((((esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ X1)!=(X1))|~((in @ X1 @ (setunion @ esk3_0)))|~((epred1_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_34]), c_0_35])).
0.21/0.50	thf(c_0_40, plain, ![X1:$i]:((((esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ X1)=(esk5_0))|~((in @ X1 @ (setunion @ esk3_0)))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
0.21/0.50	thf(c_0_41, negated_conjecture, (in @ esk5_0 @ (setunion @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.21/0.50	thf(c_0_42, negated_conjecture, (epred1_0 @ esk5_0), inference(spm,[status(thm)],[c_0_38, c_0_22])).
0.21/0.50	thf(c_0_43, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40])]), c_0_41]), c_0_42])]), ['proof']).
0.21/0.50	# SZS output end CNFRefutation
0.21/0.50	# Parsed axioms                        : 21
0.21/0.50	# Removed by relevancy pruning/SinE    : 13
0.21/0.50	# Initial clauses                      : 15
0.21/0.50	# Removed in clause preprocessing      : 0
0.21/0.50	# Initial clauses in saturation        : 15
0.21/0.50	# Processed clauses                    : 58
0.21/0.50	# ...of these trivial                  : 0
0.21/0.50	# ...subsumed                          : 4
0.21/0.50	# ...remaining for further processing  : 54
0.21/0.50	# Other redundant clauses eliminated   : 2
0.21/0.50	# Clauses deleted for lack of memory   : 0
0.21/0.50	# Backward-subsumed                    : 0
0.21/0.50	# Backward-rewritten                   : 2
0.21/0.50	# Generated clauses                    : 85
0.21/0.50	# ...of the previous two non-redundant : 76
0.21/0.50	# ...aggressively subsumed             : 0
0.21/0.50	# Contextual simplify-reflections      : 3
0.21/0.50	# Paramodulations                      : 82
0.21/0.50	# Factorizations                       : 0
0.21/0.50	# NegExts                              : 0
0.21/0.50	# Equation resolutions                 : 3
0.21/0.50	# Total rewrite steps                  : 18
0.21/0.50	# Propositional unsat checks           : 0
0.21/0.50	#    Propositional check models        : 0
0.21/0.50	#    Propositional check unsatisfiable : 0
0.21/0.50	#    Propositional clauses             : 0
0.21/0.50	#    Propositional clauses after purity: 0
0.21/0.50	#    Propositional unsat core size     : 0
0.21/0.50	#    Propositional preprocessing time  : 0.000
0.21/0.50	#    Propositional encoding time       : 0.000
0.21/0.50	#    Propositional solver time         : 0.000
0.21/0.50	#    Success case prop preproc time    : 0.000
0.21/0.50	#    Success case prop encoding time   : 0.000
0.21/0.50	#    Success case prop solver time     : 0.000
0.21/0.50	# Current number of processed clauses  : 37
0.21/0.50	#    Positive orientable unit clauses  : 8
0.21/0.50	#    Positive unorientable unit clauses: 0
0.21/0.50	#    Negative unit clauses             : 0
0.21/0.50	#    Non-unit-clauses                  : 29
0.21/0.50	# Current number of unprocessed clauses: 47
0.21/0.50	# ...number of literals in the above   : 260
0.21/0.50	# Current number of archived formulas  : 0
0.21/0.50	# Current number of archived clauses   : 17
0.21/0.50	# Clause-clause subsumption calls (NU) : 119
0.21/0.50	# Rec. Clause-clause subsumption calls : 59
0.21/0.50	# Non-unit clause-clause subsumptions  : 7
0.21/0.50	# Unit Clause-clause subsumption calls : 3
0.21/0.50	# Rewrite failures with RHS unbound    : 0
0.21/0.50	# BW rewrite match attempts            : 2
0.21/0.50	# BW rewrite match successes           : 2
0.21/0.50	# Condensation attempts                : 58
0.21/0.50	# Condensation successes               : 0
0.21/0.50	# Termbank termtop insertions          : 4798
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.013 s
0.21/0.50	# System time              : 0.001 s
0.21/0.50	# Total time               : 0.014 s
0.21/0.50	# Maximum resident set size: 2048 pages
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.016 s
0.21/0.50	# System time              : 0.002 s
0.21/0.50	# Total time               : 0.017 s
0.21/0.50	# Maximum resident set size: 1728 pages
0.21/0.50	% E---3.1 exiting
0.21/0.50	EOF